# 递归实现斐波那契数列

def feibo(n):
    if n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        return feibo(n-1) + feibo(n-2)

print(feibo(9))


